Semi-automated verification of security proofs of quantum cryptographic protocols

Security proofs of cryptographic protocols

We live in time of computers and scientific and technological progress but this time is also marked with many attacks on big Internet companies. So with expand of Internet people start to protect information that they exchange through Internet. In the Internet world it is necessary for systems as Internet banking, Internet shopping or e-commerce to secure private information that are transferre...

Automated Verification of Equivalence on Quantum Cryptographic Protocols

It is recognized that security verification of cryptographic protocols tends to be difficult and in fact, some flaws on protocol designs or security proofs were found after they had been presented. The use of formal methods is a way to deal with such complexity. Especially, process calculi are suitable to describe parallel systems. Bisimilarity, which denotes that two processes behave indisting...

Formal verification of cryptographic security proofs

Verifying cryptographic security proofs manually is inherently tedious and error-prone. The game-playing technique for cryptographic proofs advocates a modular proof design where cryptographic programs called games are transformed stepwise such that each step can be analyzed individually. This code-based approach has rendered the formal verification of such proofs using mechanized tools feasibl...

Toward Automatic Verification of Quantum Cryptographic Protocols

Several quantum process algebras have been proposed and successfully applied in verification of quantum cryptographic protocols. All of the bisimulations proposed so far for quantum processes in these process algebras are state-based, implying that they only compare individual quantum states, but not a combination of them. This paper remedies this problem by introducing a novel notion of distri...

Automated Security Proofs of Secret Shared Protocols